//
// Created by miaomiaole on 2023/6/6.
//

#include <unordered_set>
#include <iostream>
#include "unordered_container.h"
#include <memory>

using namespace std;

void unordered_print() {
    unordered_set<int> coll = {1, 2, 4, 6, 7, 8, 9, 19, 5, 3, 5, 6, 7, 8, 9, 5, 43, 23};
    for (const auto &item: coll)
        cout << item << endl;
    auto item = coll.erase(23);

    cout << item << endl;

    cout << "=======================" << endl;
    for (const auto &item: coll)
        cout << item << endl;

    if (coll.find(19) != coll.end()) {
        cout << "19 is available " << endl;
    }
}

void reference_wrapper() {
    typedef shared_ptr<float> ItemPrt;
    unordered_set<ItemPrt> bestset = {
            ItemPrt(new float(2.4)),
            ItemPrt(new float(2.5)),
            ItemPrt(new float(2.6)),
    };


}
